Degree constrained subgraphs
نویسندگان
چکیده
منابع مشابه
Degree constrained subgraphs
In this paper, we present new structural results about the existence of a subgraph where the degrees of the vertices are pre-specified. Further, we use these results to prove a 16-edge-weighting version of a conjecture by Karoński, Luczak and Thomason, an asymptotic 2-edge-weighting version of the same conjecture, and a 7/8 version of Louigi’s Conjecture.
متن کاملStructured Prediction of Degree Constrained Subgraphs
Recent study of complex graphs has revealed that not all of them are made equal. Man-made and naturally-formed graphs exhibit structural regularity and have common degree distributions that differ a great deal from the random graphs of Erdos-Renyi. A coincident discovery, made in the machine learning community, is that several multivariate prediction problems can be solved with greater accuracy...
متن کاملOptimal Matchings and Degree-Constrained Subgraphs
In this paper the term graph means a finite unoriented linear graph. The same symbol will be used for a graph and its edge-set. The degree d(v, G) of a vertex v in a graph G is simply the number of edges of G which are incident on v, with loops (edges from v to v) counted twice_ The term strict graph will be used for a graph whic h is loopless and contains at most one edge joining any pair of d...
متن کاملGraph Reconstruction with Degree-Constrained Subgraphs
Given observations about a collection of nodes, the goal of graph reconstruction is to predict a set of edges that connect the nodes in a realistic fashion. A number of similar formulations of the problem have been introduced across research areas, notably social sciences, epidemiology and biology. What is common across domains is the understanding that interesting properties of the system are ...
متن کاملA note on degree-constrained subgraphs
Elementary proofs are presented for two graph theoretic results, originally proved by H. Shirazi and J. Verstraëte using the combinatorial Nullstellensatz. In an undirected graph G = (V, E) we denote by dG(v) the degree of v ∈ V . If F (v) ⊆ N is a set of forbidden degrees for every v ∈ V , then a subgraph G = (V, E) of G is called F -avoiding if dG′(v) / ∈ F (v) for all v ∈ V . Theorem 1 (Shir...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2008
ISSN: 0166-218X
DOI: 10.1016/j.dam.2007.05.059